package com.zhangxiaofanfan.hotcode.second;

/**
 * <a href="https://leetcode.cn/problems/implement-trie-prefix-tree/description/?envType=study-plan-v2&envId=top-100-liked">208. 实现 Trie (前缀树)</a>
 *
 * @author zhangxiaofanfan
 * @date 2024-06-26 20:33:33
 */
public class HotCode054 {
    public static void main(String[] args) {

    }
}

class Trie {

    public Trie() {

    }

    public void insert(String word) {

    }

    public boolean search(String word) {
        return true;
    }

    public boolean startsWith(String prefix) {
        return false;
    }
}
